The Acta-EVER Honorary Lecture 2007
نویسندگان
چکیده
منابع مشابه
ACTA UNIVERSITATIS APULENSIS No 14/2007 COMPUTATIONAL COMPLEXITY AND GRAPHS
As we know, there exist many interesting mathematical problems in Theoretical Computer Science, as the comparison of characters between strings, or the acceptation / decision of languages by Turing Machines. Also others, as the ”halting problem” or the ”travel salesman problem”, are undecidable. And many other remain open, only conjectured. We can establish some results, known as Hierarchy Theo...
متن کامل( Fall 2007 ) Lecture 12 : Reed - Solomon Codes
We begin with the definition of Reed-Solomon codes. Definition 1.1 (Reed-Solomon code). Let Fq be a finite field and Fq[x] denote the Fq-space of univariate polynomials where all the coefficients of x are from Fq. Pick {α1, α2, ...αn} distinct elements (also called evaluation points) of Fq and choose n and k such that k ≤ n ≤ q. We define an encoding function for Reed-Solomon code as RS : Fq → ...
متن کاملCryptography April 3 , 2007 Lecture 18 : Program
The goal of program obfuscation is to provably complicate the task of reverse engineering. Owners of source code wish to make it as hard as possible for others to extract information from their binaries information which may reveal trade secrets, allow undesirable modifications, or enable software piracy. Obfuscation is typically seen as a problem relating to programming languages or compilers....
متن کاملLecture Notes : Complex Variables II , Spring 2007
These notes will contain material you should know from the final lectures of the course, which will be drawn from sources other than the text. The Riemann mapping theorem is a key theoretical result in complex analysis. The basic question is to determine the existence of conformal maps between two general domains D,D′/-. The simplest formulation is for two simplyconnected domains. We can also s...
متن کاملLecture Notes Eco 613/614 Fall 2007
This infinite-dimensional object is a function of the current state. We have to decide how to approximate it numerically. One approach is to discretize the state and approximate the conditional expectation by the finite set of its values at each point in the state space. This technique involves replacing the continuous-valued Markov chain for λ with a finitely-many-discrete-valued Markov chain....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Ophthalmologica
سال: 2008
ISSN: 1755-375X
DOI: 10.1111/j.1755-3768.2008.01415.x